One-dimensional spatial join processing using a DOT-based index structure
نویسندگان
چکیده
1Research Center of Information and Electronic Engineering, Hallym University, Korea, Hallymdaehak-gil, Chuncheon, Gangwon-do 200-702, Korea E-mail: [email protected] 2Division of Information Engineering and Telecommunications, Hallym University, Korea E-mail: {[email protected], [email protected]} 3Department of Computer Science, Yonsei University, Korea. E-mail:[email protected] 4College of Information and Communications, Hanyang University, Korea 17 Haengdang-dong, Seongdong-gu, Seoul 133-791, Korea E-mail: [email protected]
منابع مشابه
Efficient processing of spatial joins with DOT-based indexing
0020-0255/$ see front matter 2009 Elsevier Inc doi:10.1016/j.ins.2009.11.029 * Corresponding author. Tel./fax: +82 2 2220 456 E-mail addresses: [email protected] (H. B (S. Park), [email protected] (S.-W. Kim). A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an...
متن کاملOptimizing Join Index Based Spatial-Join Processing: A Graph Partitioning Approach
A Join Index is a data structure that optimizes the join query processing in spatial databases. Join indices use pre-computation techniques to speed up online query processing and are useful for applications which require low update rates. The cost of spatial join computation using a join-index with limited buuer space depends primarily on the page access sequence used to fetch the pages of the...
متن کاملEfficient index-based KNN join processing for high-dimensional data
In many advanced database applications (e.g., multimedia databases), data objects are transformed into high-dimensional points and manipulated in high-dimensional space. One of the most important but costly operations is the similarity join that combines similar points from multiple datasets. In this paper, we examine the problem of processing K-nearest neighbor similarity join (KNN join). KNN ...
متن کاملPlug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
This paper presents Plug&Join, a new generic algorithm for efficiently processing a broad class of different types of joins in an extensible database system. Plug&Join is not only designed to support equi joins, temporal joins, spatial joins, subset joins and other types of joins, but in contrast to previous algorithms it can be easily customized and it allows efficient processing of new types ...
متن کاملSpatial Join Processing Using Corner Transformation
ÐSpatial join finds pairs of spatial objects having a specific spatial relationship in spatial database systems. Since spatial join is a fairly expensive operation, we need an efficient algorithm taking advantage of the characteristics of available spatial access methods. In this paper, we propose a spatial join algorithm using corner transformation and show its excellence through experiments. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Syst. Sci. Eng.
دوره 28 شماره
صفحات -
تاریخ انتشار 2013